The monic rank
نویسندگان
چکیده
منابع مشابه
Monic integer Chebyshev problem
We study the problem of minimizing the supremum norm by monic polynomials with integer coefficients. Let Mn(Z) denote the monic polynomials of degree n with integer coefficients. A monic integer Chebyshev polynomial Mn ∈ Mn(Z) satisfies ‖Mn‖E = inf Pn∈Mn(Z) ‖Pn‖E . and the monic integer Chebyshev constant is then defined by tM (E) := lim n→∞ ‖Mn‖ E . This is the obvious analogue of the more usu...
متن کاملThe monic integer transfinite diameter
We study the problem of finding nonconstant monic integer polynomials, normalized by their degree, with small supremum on an interval I. The monic integer transfinite diameter tM(I) is defined as the infimum of all such supremums. We show that if I has length 1, then tM(I) = 1 2 . We make three general conjectures relating to the value of tM(I) for intervals I of length less than 4. We also con...
متن کاملThe MONIC Framework for Cluster Transition Detection
There is much recent work on detecting and tracking changes in clusters, often based on the study of their spatiotemporal properties. For the many applications where cluster change is relevant, among them customer relationship management, fraud detection and marketing, it is also necessary to provide insights about the nature of change: Is a cluster corresponding to a group of customers simply ...
متن کاملMONIC SUN and REMI TRUDEL*
This article proposes a utilitarian model in which recycling could reduce consumers’ negative emotions from wasting resources (i.e., taking more resources than what is being consumed) and increase consumers’ positive emotions from disposing of consumed resources. The authors provide evidence for each component of the utility function using a series of choice problems and formulate hypotheses on...
متن کاملMonic Non-commutative Orthogonal Polynomials
For a measure μ on R, the situation is more subtle. One can always orthogonalize the subspaces of polynomials of different total degree (so that one gets a family of pseudo-orthogonal polynomials). The most common approach is to work directly with these subspaces, without producing individual orthogonal polynomials; see, for example [DX01]. One can also further orthogonalize the polynomials of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2020
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom/3512